On Topological Numbers of Graphs

نویسندگان

  • Ullas Thomas
  • Sunil C Mathew
چکیده

This paper introduces the notion of discrete t-set graceful graphs and obtains some of their properties. It also examines the interrelations among different types of set-indexers, namely, set-graceful, set-semigraceful, topologically set-graceful (t-set graceful), strongly t-set graceful and discrete t-set graceful and establishes how all these notions are interdependent or not. AMS Mathematics Subject Classification (2010): 05C78; 05C10

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Domination parameters of Cayley graphs of some groups

‎In this paper‎, ‎we investigate domination number‎, ‎$gamma$‎, ‎as well‎ ‎as signed domination number‎, ‎$gamma_{_S}$‎, ‎of all cubic Cayley‎ ‎graphs of cyclic and quaternion groups‎. ‎In addition‎, ‎we show that‎ ‎the domination and signed domination numbers of cubic graphs depend‎ on each other‎.

متن کامل

The topological ordering of covering nodes

The topological ordering algorithm sorts nodes of a directed graph such that the order of the tail of each arc is lower than the order of its head. In this paper, we introduce the notion of covering between nodes of a directed graph. Then, we apply the topological orderingalgorithm on graphs containing the covering nodes. We show that there exists a cut set withforward arcs in these...

متن کامل

The Topological Indices of some Dendrimer Graphs

In this paper the Wiener and hyper Wiener index of two kinds of dendrimer graphs are determined. Using the Wiener index formula, the Szeged, Schultz, PI and Gutman indices of these graphs are also determined.

متن کامل

Reciprocal Degree Distance of Grassmann Graphs

Recently, Hua et al. defined a new topological index based on degrees and inverse of distances between all pairs of vertices. They named this new graph invariant as reciprocal degree distance as 1 { , } ( ) ( ( ) ( ))[ ( , )] RDD(G) = u v V G d u  d v d u v , where the d(u,v) denotes the distance between vertices u and v. In this paper, we compute this topological index for Grassmann graphs.

متن کامل

On the M-polynomial of planar chemical graphs

Let $G$ be a graph and let $m_{i,j}(G)$, $i,jge 1$, be the number of edges $uv$ of $G$ such that ${d_v(G), d_u(G)} = {i,j}$. The $M$-polynomial of $G$ is $M(G;x,y) = sum_{ile j} m_{i,j}(G)x^iy^j$. With $M(G;x,y)$ in hands, numerous degree-based topological indices of $G$ can be routinely computed. In this note a formula for the $M$-polynomial of planar (chemical) graphs which have only vertices...

متن کامل

Some topological indices of graphs and some inequalities

Let G be a graph. In this paper, we study the eccentric connectivity index, the new version of the second Zagreb index and the forth geometric–arithmetic index.. The basic properties of these novel graph descriptors and some inequalities for them are established.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2015